Convergence of Hypervolume-Based Archiving Algorithms II: Competetiveness
نویسندگان
چکیده
We study the convergence behavior of (μ + λ)-archiving algorithms. A (μ + λ)-archiving algorithm defines how to choose in each generation μ children from μ parents and λ offspring together. Archiving algorithms have to choose individuals online without knowing future offspring. Previous studies assumed the offspring generation to be best-case. We assume the initial population and the offspring generation to be worst-case and use the competitive ratio to measure how much smaller hypervolumes an archiving algorithm finds due to not knowing the future in advance. We prove that all archiving algorithms which increase the hypervolume in each step (if they can) are only μ-competitive. We also present a new archiving algorithm which is (4 + 2/μ)-competitive. This algorithm not only achieves a constant competitive ratio, but is also efficiently computable. Both properties provably do not hold for the commonly used greedy archiving algorithms, for example those used in SIBEA, SMS-EMOA, or the generational MO-CMA-ES.
منابع مشابه
Bounding the Effectiveness of Hypervolume-Based (μ + λ)-Archiving Algorithms
In this paper, we study bounds for the α-approximate effectiveness of non-decreasing (μ+λ)-archiving algorithms that optimize the hypervolume. A (μ + λ)-archiving algorithm defines how μ individuals are to be selected from a population of μ parents and λ offspring. It is non-decreasing if the μ new individuals never have a lower hypervolume than the μ original parents. An algorithm is α-approxi...
متن کاملOn Sequential Online Archiving of Objective Vectors
In this paper, we examine the problem of maintaining an approximation of the set of nondominated points visited during a multiobjective optimization, a problem commonly known as archiving. Most of the currently available archiving algorithms are reviewed, and what is known about their convergence and approximation properties is summarized. The main scenario considered is the restricted case whe...
متن کاملAnalyzing Hypervolume Indicator Based Algorithms
Goals: understand why hypervolume-based search is that successful understand basic properties of hypervolume indicator Approach: rigorous running time analyses of a hypervolume-based MOEA for (i) approaching the Pareto front (ii) approximating large Pareto fronts (unary) hypervolume indicator (A) = hypervolume/area of dominated part of search space between front A and reference point Pareto-dom...
متن کاملMaximising Hypervolume for Selection in Multi-objective Evolutionary Algorithms [CEC7721]
When hypervolume is used as part of the selection or archiving process in a multi-objective evolutionary algorithm, the basic requirement is to choose a subset of the solutions in a non-dominated front such that the hypervolume of the subset is maximised. We describe and evaluate two algorithms to approximate this process: a greedy algorithm that assesses and eliminates solutions individually, ...
متن کاملMulti-objective approaches for the open-pit mining operational planning problem
This work presents three multi-objective heuristic algorithms based on Two-phase Pareto Local Search with VNS (2PPLS-VNS), Multi-objective Variable Neighborhood Search (MOVNS) and Non-dominated Sorting Genetic Algorithm II (NSGA-II). The algorithms were applied to the open-pit-mining operational planning problem with dynamic truck allocation (OPMOP). Approximations to Pareto sets generated by t...
متن کامل